An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
نویسندگان
چکیده
Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression E via the k-CContinuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression E over a ranked alphabet Σ and produce a O(R · |E |) time and space complexity algorithm, where R is the maximal rank of a symbol occurring in Σ and |E | is the size of E. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an O(|Q| · |E |) time and space complexity, where |Q| is the number of states of the produced automaton, is more efficient than the one obtained by Kuske and Meinecke.
منابع مشابه
TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملFrom C-Continuations to New Quadratic Algorithms for Automaton Synthesis
Two classical non-deterministic automata recognize the language denoted by a regular expression: the position automaton which deduces from the position sets defined by Glushkov and McNaughton-Yamada, and the equation automaton which can be computed via Mirkin’s prebases or Antimirov’s partial derivatives. Let |E| be the size of the expression and ‖E‖ be its alphabetic width, i.e. the number of ...
متن کاملAn Efficient Predictive Model for Probability of Genetic Diseases Transmission Using a Combined Model
In this article, a new combined approach of a decision tree and clustering is presented to predict the transmission of genetic diseases. In this article, the performance of these algorithms is compared for more accurate prediction of disease transmission under the same condition and based on a series of measures like the positive predictive value, negative predictive value, accuracy, sensitivit...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل